Rasiowa-Sikorski proof system for the non-Fregean sentential logic SCI

نویسنده

  • Joanna Golinska-Pilarek
چکیده

The sentential logic SCI is obtained from the classical sentential calculus by adding a new identity connective ≡ (different from ↔) and axioms which say ”α ≡ β” means ”α is identical to β” . From the axioms for ≡ it follows that the range of sentences has at least two elements. No other special presupposition about the meaning of ’is identical to’ nor the range of sentences are assumed. Any additional conditions for the range or the nature of connectives lead to an extension of SCI. In other words, SCI seems to be as weak as it is possible. Most of known sentential calculus classical, modal, intuitionistic are extensions of SCI. In this section we present the basic definitions of the non-Fregean sentential logic. They can be found in [1], [7] and [8], among others.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logical Analysis of Demonic Nondeterministic Programs

A logical framework is presented for representing and reasoning about nondeterministic programs that may not terminate. We propose a logic PDL(; ;, ||, d(∗)) which is an extension of dynamic logic such that the program constructors related to demonic operations are introduced in its language. A complete and sound Hilbert-style proof system is given and it is shown that PDL(; ;, ||, d(∗)) is dec...

متن کامل

An efficient relational deductive system for propositional non-classical logics

We describe a relational framework that uniformly supports formalization and automated reasoning in various propositional modal logics. The proof system we propose is a relational variant of the classical Rasiowa-Sikorski proof system. We introduce a compact graph-based representation of formulae and proofs supporting an efficient implementation of the basic inference engine, as well as of a nu...

متن کامل

Rasiowa-Sikorski deduction systems in computer science applications

A Rasiowa-Sikorski system is a sequence-type formalization of logics. The system uses invertible decomposition rules which decompose a formula into sequences of simpler formulae whose validity is equivalent to validity of the original formula. There may also be expansion rules which close indecomposable sequences under certain properties of relations appearing in the formulae, like symmetry or ...

متن کامل

Quantified Modal Logic on the Rational Line

In the topological semantics for propositional modal logic, S4 is known to be complete for the class of all topological spaces, for the rational line, for Cantor space, and for the real line. In the topological semantics for quantified modal logic, QS4 is known to be complete for the class of all topological spaces, and for the family of subspaces of the irrational line. The main result of the ...

متن کامل

Adequacy and Complete Axiomatization for Timed Modal Logic

In this paper we develop the metatheory for Timed Modal Logic (TML), which is the modal logic used for the analysis of timed transition systems (TTSs). We solve a series of long-standing open problems related to TML. Firstly, we prove that TML enjoys the Hennessy-Milner property and solve one of the open questions in the field. Secondly, we prove that the set of validities are not recursively e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of Applied Non-Classical Logics

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2007